home *** CD-ROM | disk | FTP | other *** search
- Path: osip74.ionet.net!user
- From: cpruett@ionet.net (Chris Pruett)
- Newsgroups: comp.lang.c
- Subject: Fast Integer Square Root Algorithm
- Date: Sat, 20 Jan 1996 21:41:52 -0600
- Organization: Internet Oklahoma
- Message-ID: <cpruett-2001962141520001@osip74.ionet.net>
- NNTP-Posting-Host: osip74.ionet.net
- X-Newsreader: Yet Another NewsWatcher 2.1.1
-
- Can anyone lend suggestions or give me a reference to a very
- fast integer square root algorithm?
-
- 1) Must take square root of unsigned, long integer (32-bit).
- 2) Accuracy is not terribly important. +/- 100 is acceptable.
-
- The best I've been able to come up with is Newton's method.
- Is there something better?
-
- Thanks.
-
- CP
-